Mixed Production Line Optimization of Industrialized Building Based on Ant Colony Optimization Algorithm

نویسندگان

چکیده

Prefabricated components production line optimization is critical for improving industrialized building construction efficiency; however, few studies focus on the problem in context of construction. In order to optimize large random orders prefabricated process, this research proposes a model minimize variance capacity utilization cycle, and ant colony algorithm introduced solve mixed sequencing problem. By optimizing sequence, component balanced, rate process improved. Finally, effectiveness method verified through real case fabricated production. The results show that daily optimized hybrid has reduced 0.53%, which significantly lower than 2.45% before optimization. proposed could effectively achieve balance line.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ant Colony Optimization Algorithm

Hybrid algorithm is proposed to solve combinatorial optimization problem by using Ant Colony and Genetic programming algorithms. Evolutionary process of Ant Colony Optimization algorithm adapts genetic operations to enhance ant movement towards solution state. The algorithm converges to the optimal final solution, by accumulating the most effective sub-solutions.

متن کامل

FORCED WATER MAIN DESIGN MIXED ANT COLONY OPTIMIZATION

Most real world engineering design problems, such as cross-country water mains, include combinations of continuous, discrete, and binary value decision variables. Very often, the binary decision variables associate with the presence and/or absence of some nominated alternatives or project’s components. This study extends an existing continuous Ant Colony Optimization (ACO) algorithm to simultan...

متن کامل

Evolutionary Algorithm Ant Colony Optimization

I Which size? Trade-off I Minimum size: connectivity by recombination is achieved if at least one instance of every allele is guaranteed to be be present at each locus. Ex: if binary: P∗ 2 = (1− (0.5) ) for l = 50, it is sufficient M = 17 to guarantee P∗ 2 > 99.9%. I Often: independent, uninformed random picking from given search space. I Attempt to cover at best the search space, eg, Latin hyp...

متن کامل

An Ant Colony Optimization Algorithm for Network Vulnerability Analysis

Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...

متن کامل

Noisy images edge detection: Ant colony optimization algorithm

The edges of an image define the image boundary. When the image is noisy, it does not become easy to identify the edges. Therefore, a method requests to be developed that can identify edges clearly in a noisy image. Many methods have been proposed earlier using filters, transforms and wavelets with Ant colony optimization (ACO) that detect edges. We here used ACO for edge detection of noisy ima...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Civil Engineering

سال: 2022

ISSN: ['1687-8086', '1687-8094']

DOI: https://doi.org/10.1155/2022/2411458